School of Computer EngineeringcoretheorySem 6
FINITE AUTOMATA AND COMPILER DESIGN
CSS 3101
Syllabus
- 01Languages
- 02Regular Expressions
- 03Finite Automata – DFA, NFA
- 04Conversion of Regular Expression to NFA
- 05NFA to DFA
- 06Context Free Grammars and Parsing
- 07Derivation
- 08Parse Trees
- 09Push Down Automata
- 10Introduction to Language Processors
- 11The Structure of a Compiler
- 12Lexical Analysis: Role of the Lexical Analyzer, Input Buffering
- 13Specifications and Recognition of Tokens
- 14Writing a Grammar
- 15Top Down Parsing
- 16Bottom Up Parsing
- 17Introduction to LR parsing
- 18More powerful LR Parsers
- 19Syntax-Directed Translation: Syntax-Directed Definitions
- 20Application of Syntax-Directed Translation
- 21Intermediate Code Generation: Variants of Syntax Trees, Three Address Code
- 22Code Generation: Issues in Design of Code Generator, Basic Blocks and Flow Graphs
- 23Introduction to LEX and YACC
References
- Peter Linz, an Introduction to Formal Languages and Automata, (6e), Jones & Bartlett Learning, 2019
- Alfred V. Aho, Monica S. Lam, Ravi Sethi, Jeffrey D. Ullman, Compilers Principles, Techniques and Tools, (2e), Pearson Education, 2010
- J E Hopcroft, Rajeev Motwani & Jeffrey D Ullman, Introduction to Automata Theory, Languages and Computation, (3e), Pearson Education, 2006
- Kenneth C. Louden, Compiler Construction - Principles and Practice, (1e), Thomson, 2007
- John R. Levine, Tony Manson, Doug Brown, LEX & YACC, (2e), O Reilly Media, 2012
Credits Structure
3Lecture
1Tutorial
0Practical
4Total